Relational Database with Sql and Graph Database

نویسنده

  • Charles Bachmann
چکیده

This paper represents the study of various theory based on database model. In this paper a study of various papers is done, and in the reviewed paper graph database and SQL is done. This huge repository of unstructured data has resulted in making the data search and knowledge extraction, a very cumbersome task if one continues using the legacy relational database.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Hidden Structures in Relational Databases

Relational database management systems have been widely used over decades. An important research issue is to find hidden structural information in large relational databases. By hidden structural information we mean the information that cannot be easily found using a traditional query language SQL. In this talk, we discuss how to find hidden structural information in a relational database by vi...

متن کامل

Applying the graph-oriented GUPRO Approach in comparison to a Relational Database based Approach

GUPRO (GReQL) Results Graph Repository Extract: ANAL, SoftSpec Relational Database Abstract: RepoView (SQL) Source code Results

متن کامل

Comparing Graph-Based Program Comprehension Tools to Relational Database-Based Tools

GUPRO (GReQL) Results Graph Repository Extract: ANAL, SoftSpec Relational Database Abstract: RepoView (SQL) Source code Results

متن کامل

Advantages Of Object Relational Database Model

This article explores the differences between relational databases (RDBMS) and You should have looked into the property-graph model and optionally read especially for join heavy queries, the minutes to milliseconds advantage that Even object-relational mappers use SQL under the hood to talk to the database. When you write applications that communicate with a relational database, your created a ...

متن کامل

A Join Operator for Property Graphs

In the graph database literature the term “join” does not refer to an operator combining two graphs, but involves path traversal queries over a single graph. Current languages express binary joins through the combination of path traversal queries with graph creation operations. Such solution proves to be not efficient. In this paper we introduce a binary graph join operator and a corresponding ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015